package 二分查找;

public class 山脉数组的峰顶索引5 {
    //https://leetcode.cn/problems/peak-index-in-a-mountain-array/description/
    public int peakIndexInMountainArray(int[] arr) {
        int left = 1, right = arr.length - 2;
        while(left < right) {
            int mid = left + (right - left) / 2;
            if(arr[mid] < arr[mid + 1]) left = mid + 1;
            else right = mid;
        }
        return left;
    }
}
